Handling Convexity-Like Constraints in Variational Problems
نویسندگان
چکیده
منابع مشابه
Handling Convexity-Like Constraints in Variational Problems
We provide a general framework to construct finite-dimensional approximations of the space of convex functions, which also applies to the space of c-convex functions and to the space of support functions of convex bodies. We give precise estimates of the distance between the approximation space and the admissible set. This framework applies to the approximation of convex functions by piecewise-...
متن کاملConvexity Properties of Inverse Problems with Variational Constraints
When an inverse problem can be formulated so the data are minima of one of the variational problems of mathematical physics, feasibility constraints can be found for the nonlinear inversion problem. These constraints guarantee that optimal solutions of the inverse problem lie in the convex feasible region of the model space. Furthermore, points on the boundary of this convex region can be found...
متن کاملVector Optimization Problems and Generalized Vector Variational-Like Inequalities
In this paper, some properties of pseudoinvex functions, defined by means of limiting subdifferential, are discussed. Furthermore, the Minty vector variational-like inequality, the Stampacchia vector variational-like inequality, and the weak formulations of these two inequalities defined by means of limiting subdifferential are studied. Moreover, some relationships between the vector vari...
متن کاملAn algorithm for computing solutions of variational problems with global convexity constraints
We present an algorithm to approximate the solutions to variational problems where set of admissible functions consists of convex functions. The main motivation behind the numerical method is to compute solutions to Adverse Selection problems within a Principal-Agent framework. Problems such as product lines design, optimal taxation, structured derivatives design, etc. can be studied through th...
متن کاملNumerical Approach to the Estimation of Solutions of some Variational Problems with Convexity Constraints ∗
We present an algorithm to approximate the solutions to variational problems where set of admissible functions consists of convex functions. The main motivator behind this numerical method is estimating solutions to Adverse Selection problems within a Principal-Agent framework. Problems such as product lines design, optimal taxation, structured derivatives design, etc. can be studied through th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 2014
ISSN: 0036-1429,1095-7170
DOI: 10.1137/130938359